Approximate invariant subspaces and quasi-newton optimization methods

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate invariant subspaces and quasi-newton optimization methods

New approximate secant equations are shown to result from the knowledge of (problem dependent) invariant subspace information, which in turn suggests improvements in quasi-Newton methods for unconstrained minimization. A new limitedmemory BFGS using approximate secant equations is then derived and its encouraging behaviour illustrated on a small collection of multilevel optimization examples. T...

متن کامل

Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization

Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.

متن کامل

Certification Using Newton-Invariant Subspaces

For a square system of analytic equations, a Newton-invariant subspace is a set which contains the resulting point of a Newton iteration applied to each point in the subspace. For example, if the equations have real coefficients, then the set of real points form a Newtoninvariant subspace. Starting with any point for which Newton’s method quadratically converges to a solution, this article uses...

متن کامل

Invariant Subspaces, Quasi-invariant Subspaces, and Hankel Operators

In this paper, using the theory of Hilbert modules we study invariant subspaces of the Bergman spaces on bounded symmetric domains and quasi-invariant sub-spaces of the Segal–Bargmann spaces. We completely characterize small Hankel operators with finite rank on these spaces.

متن کامل

Proximal Quasi-Newton Methods for Convex Optimization

In [19], a general, inexact, e cient proximal quasi-Newton algorithm for composite optimization problems has been proposed and a sublinear global convergence rate has been established. In this paper, we analyze the convergence properties of this method, both in the exact and inexact setting, in the case when the objective function is strongly convex. We also investigate a practical variant of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Methods and Software

سال: 2010

ISSN: 1055-6788,1029-4937

DOI: 10.1080/10556780902992746